686A - Free Ice Cream - CodeForces Solution


constructive algorithms implementation *800

Please click on ads to support us..

Python Code:

if __name__ == '__main__':
    ll = input().split()
    t = int(ll[0])
    x = int(ll[1])
    count = 0

    while t > 0:
        t -= 1
        ll = input().split()
        c = ll[0]
        p = int(ll[1])
        if c == '+':
            x += p
        elif x-p >= 0:
            x -= p
        else:
            count += 1
    print(x, count)


C++ Code:

//Author : Furkan
#include <bits/stdc++.h>
using namespace std;

long long int ds;
long long int s=0;
function<long long int()> f = [](){
    char c;
    long long int x;
    cin>>c>>x;
    if(c=='-'){
        if(ds<x) s++;
        else ds-=x;
    }
    else{
        ds+=x;
    }
    return 0;
};

int main(){
    long long int t=1;
    cin>>t>>ds;
    for(int i=0;i<t;i++){
        f();
    }
    cout<<ds<<" "<<s;
    return 0;
}


Comments

Submit
0 Comments
More Questions

1330A - Dreamoon and Ranking Collection
1692B - All Distinct
1156C - Match Points
1675A - Food for Animals
1328C - Ternary XOR
1689A - Lex String
1708B - Difference of GCDs
863A - Quasi-palindrome
1478A - Nezzar and Colorful Balls
1581B - Diameter of Graph
404A - Valera and X
908A - New Year and Counting Cards
146A - Lucky Ticket
1594C - Make Them Equal
1676A - Lucky
1700B - Palindromic Numbers
702C - Cellular Network
1672C - Unequal Array
1706C - Qpwoeirut And The City
1697A - Parkway Walk
1505B - DMCA
478B - Random Teams
1705C - Mark and His Unfinished Essay
1401C - Mere Array
1613B - Absent Remainder
1536B - Prinzessin der Verurteilung
1699B - Almost Ternary Matrix
1545A - AquaMoon and Strange Sort
538B - Quasi Binary
424A - Squats